翻訳と辞書 Words near each other ・ Self-categorization theory ・ Self-censorship ・ Self-Certification (New York City Department of Buildings) ・ Self-certifying File System ・ Self-certifying key ・ Self-Changing Gears ・ Self-checkout ・ Self-clasping handshake ・ Self-cleaning glass ・ Self-cleaning oven ・ Self-clocking signal ・ Self-compassion ・ Self-competition ・ Self-complementary adeno-associated virus (scAAV) ・ Self-complementary antenna ・ Self-complementary graph ・ Self-complexity ・ Self-concealment ・ Self-concept ・ Self-concordant function ・ Self-condensation ・ Self-confidence ・ Self-confirming equilibrium ・ Self-conscious emotions ・ Self-consciousness ・ Self-consciousness (Vedanta) ・ Self-consistency principle in high energy Physics ・ Self-consistent mean field ・ Self-consistent mean field (biology) ・ Self-consolidating concrete Dictionary Lists mini英和辞書 mini和英辞書 Webster 1913 Latin-English FOLDOC Wikipedia English ウィキペディア

翻訳と辞書　辞書検索 [ 開発暫定版 ] スポンサード リンク Self-complementary graph ： ウィキペディア英語版 Self-complementary graph A self-complementary graph is a graph which is isomorphic to its complement. The simplest non-trivial self-complementary graphs are the 4-vertex path graph and the 5-vertex cycle graph. ==Examples== Every Paley graph is self-complementary.〔 For example, the 3 × 3 rook's graph (the Paley graph of order nine) is self-complementary, by a symmetry that keeps the center vertex in place but exchanges the roles of the four side midpoints and four corners of the grid.〔.〕 All strongly regular self-complementary graphs with fewer than 37 vertices are Paley graphs; however, there are strongly regular graphs on 37, 41, and 49 vertices that are not Paley graphs.〔.〕 The Rado graph is an infinite self-complementary graph. 抄文引用元・出典: フリー百科事典『 ウィキペディア（Wikipedia）』 ■ウィキペディアで「Self-complementary graph」の詳細全文を読む スポンサード リンク 翻訳と辞書 : 翻訳のためのインターネットリソース Copyright(C) kotoba.ne.jp 1997-2016. All Rights Reserved.